#include <bits/stdc++.h>

#define in read()
#define fi first
#define se second
#define pb push_back
#define rep(i, x, y) for(int i = (x); i <= (y); i++)
#define per(i, x, y) for(int i = (x); i >= (y); i--)

using namespace std;

typedef long long ll;
typedef double db;
typedef vector < int > vec;
typedef pair < int , int > pii;

int read() {
    int x = 0; bool f = 0; char ch = getchar(); while(!isdigit(ch)) f |= ch == '-',ch = getchar();
    while(isdigit(ch)) x = x * 10 + (ch ^ 48),ch = getchar(); return f ? -x : x;
}

const int N = 2e5 + 10;

int n, a[N], ans[N];

void solve() {
	n = in; rep(i, 1, n) a[i] = in;
	priority_queue < pii > q;
	int j = 1;
	rep(i, 1, n) {
		while(j <= n && j < i * 2) q.push({ a[j], -j }), j++;
		ans[-q.top().se] = i; q.pop();
	}
	rep(i, 1, n) printf("%d ", ans[i]); puts(""); return;
}

int main() {
#ifndef ONLINE_JUDGE
    freopen("1.in","r",stdin);
#endif
    for(int T = in; T; T--) solve();
}
